منابع مشابه
The Groups of Order at Most 2000
We announce the construction up to isomorphism of the 49 910 529 484 groups of order at most 2000.
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملOn rational groups with Sylow 2-subgroups of nilpotency class at most 2
A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.
متن کاملThe chromatic index of multigraphs of order at most 10
The maximum of the maximum degree and the 'odd set quotients' provides a well-known lower bound 4)(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals qS(G) and that if G is a multigraph of order 10, the chromatic index of G cannot exceed qS(G) + 1. We identify those multigraphs G of order 9 and 10 whose chromat...
متن کاملA Characterization of the Suzuki Groups by Order and the Largest Elements Order
One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let be a finite group. We denote by the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if is a group with an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Research Announcements of the American Mathematical Society
سال: 2001
ISSN: 1079-6762
DOI: 10.1090/s1079-6762-01-00087-7